Automatic Penalty and Degree Continuation for Parallel Pre-Conditioned Mesh Curving on Virtual Geometry
نویسندگان
چکیده
We present a distributed parallel mesh curving method for virtual geometry. The main application is to generate large-scale curved meshes on complex geometry suitable analysis with unstructured high-order methods. Accordingly, we devise the technique geometrically accurate composed of high-quality elements. To this end, advocate degree continuation penalty-based second-order optimizer that uses global tight tolerances converge distortion residuals. reduce memory footprint, waiting time, and energy consumption, combine three ingredients. First, propose matrix-free GMRES solver pre-conditioned successive over-relaxation by blocks footprint times. also an adaptive penalty technique, number non-linear iterations. Third, indicator required linear tolerance On thousands cores, curves millions quartic elements featuring highly stretched while matching topology.
منابع مشابه
Automatic pre-mesh CAD data repairing
Computer aided design (CAD) models are the starting point for many downstream applications such as mesh generation, structural/fluid/thermal analysis, rapid prototyping, numerical controlled machining, casting, computer graphics. Each of these downstream applications are strongly dependent on the accuracy and consistency of the input geometry, but due to numerical problems, imprecise design, so...
متن کاملTowards an Efficient Distributed Geometry for Parallel Mesh Generation
This paper discusses the implementation of a distributed geometry for parallel mesh generation, involving dynamic load-balancing and hence dynamic re-partitioning of the geometry. A novel approach is described for improving the efficiency of the distributed geometry interface when dealing with irregular shaped mesh partitions.
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملThe Sub-Mesh Penalty Method
The Sub-Mesh Penalty (SMP) method, a new fictitious domain method of high order is presented. The final aim is to develop an efficient coupling between incompressible multiphase flows and fixed or moving obstacles of complex shape. The flow is solved on a fixed Cartesian grid and the solid objects are represented by Lagrangian surface elements. Several validation problems in 2D and 3D are prese...
متن کاملA Geometry-aware Data Partitioning Algorithm for Parallel Quad Mesh Generation on Large-scale 2D Regions
We develop a partitioning algorithm to decompose complex 2D data into small simple subregions for effective parallel quad meshing. We formulate the partitioning problem for effective parallel quad meshing as a quadratic integer optimization problem with linear constraints. Directly solving this problem is expensive for large-scale data partitioning. Hence, we suggest a more efficient two-step a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Aided Design
سال: 2022
ISSN: ['1879-2685', '0010-4485']
DOI: https://doi.org/10.1016/j.cad.2022.103208